MozartV1, Main, Exploration, bibRecord, 001B84

Approximate Constrained Subgraph Matching

Identifieur interne : 001B84 ( Main/Exploration ); précédent : 001B83; suivant : 001B85

Approximate Constrained Subgraph Matching

Auteurs : Stéphane Zampelli [Belgique] ; Yves Deville [Belgique] ; Pierre Dupont [Belgique]

Source :

Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.

RBID : ISTEX:26F305292541457FD20654B2FB9433989CC9575C

Abstract

Abstract: Our goal is to build a declarative framework for approximate graph matching where various constraints can be stated upon the pattern graph, enabling approximate constrained subgraph matching, extending models and constraints proposed by Rudolf [1] and Valiente et al. [2]. In the present work, we propose a CSP approach for approximate subgraph matching where the potential approximation is declaratively stated in the pattern graph as mandatory/optional nodes/edges. Forbidden edges, that is edges that may not be included in the matching, can be declared on the pattern graph. We also want to declare properties between pairs of nodes in the pattern graph, such as distance properties, that can be either stated by the user, or automatically inferred by the system. In the former case, such properties can define new approximate patterns. In the latter case, these redundant constraints enhance the pruning.

Url:

https://api.istex.fr/document/26F305292541457FD20654B2FB9433989CC9575C/fulltext/pdf

DOI: 10.1007/11564751_74

Affiliations:

Links toward previous steps (curation, corpus...)

to stream Istex, to step Corpus: 001650
to stream Istex, to step Curation: 001298
to stream Istex, to step Checkpoint: 001516
to stream Main, to step Merge: 001C13
to stream Main, to step Curation: 001B84

Le document en format XML

<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Approximate Constrained Subgraph Matching</title>
<author><name sortKey="Zampelli, Stephane" sort="Zampelli, Stephane" uniqKey="Zampelli S" first="Stéphane" last="Zampelli">Stéphane Zampelli</name>
</author>
<author><name sortKey="Deville, Yves" sort="Deville, Yves" uniqKey="Deville Y" first="Yves" last="Deville">Yves Deville</name>
</author>
<author><name sortKey="Dupont, Pierre" sort="Dupont, Pierre" uniqKey="Dupont P" first="Pierre" last="Dupont">Pierre Dupont</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:26F305292541457FD20654B2FB9433989CC9575C</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/11564751_74</idno>
<idno type="url">https://api.istex.fr/document/26F305292541457FD20654B2FB9433989CC9575C/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001650</idno>
<idno type="wicri:Area/Istex/Curation">001298</idno>
<idno type="wicri:Area/Istex/Checkpoint">001516</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Zampelli S:approximate:constrained:subgraph</idno>
<idno type="wicri:Area/Main/Merge">001C13</idno>
<idno type="wicri:Area/Main/Curation">001B84</idno>
<idno type="wicri:Area/Main/Exploration">001B84</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Approximate Constrained Subgraph Matching</title>
<author><name sortKey="Zampelli, Stephane" sort="Zampelli, Stephane" uniqKey="Zampelli S" first="Stéphane" last="Zampelli">Stéphane Zampelli</name>
<affiliation wicri:level="4"><country xml:lang="fr">Belgique</country>
<wicri:regionArea>Department of Computing Science and Engineering, Université Catholique de Louvain, 2, Place Sainte-Barbe, 1348, Louvain-la-Neuve</wicri:regionArea>
<orgName type="university">Université catholique de Louvain</orgName>
<placeName><settlement type="city">Louvain-la-Neuve</settlement>
<region type="region" nuts="1">Région wallonne</region>
<region type="province" nuts="1">Province du Brabant wallon</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Belgique</country>
</affiliation>
</author>
<author><name sortKey="Deville, Yves" sort="Deville, Yves" uniqKey="Deville Y" first="Yves" last="Deville">Yves Deville</name>
<affiliation wicri:level="4"><country xml:lang="fr">Belgique</country>
<wicri:regionArea>Department of Computing Science and Engineering, Université Catholique de Louvain, 2, Place Sainte-Barbe, 1348, Louvain-la-Neuve</wicri:regionArea>
<orgName type="university">Université catholique de Louvain</orgName>
<placeName><settlement type="city">Louvain-la-Neuve</settlement>
<region type="region" nuts="1">Région wallonne</region>
<region type="province" nuts="1">Province du Brabant wallon</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Belgique</country>
</affiliation>
</author>
<author><name sortKey="Dupont, Pierre" sort="Dupont, Pierre" uniqKey="Dupont P" first="Pierre" last="Dupont">Pierre Dupont</name>
<affiliation wicri:level="4"><country xml:lang="fr">Belgique</country>
<wicri:regionArea>Department of Computing Science and Engineering, Université Catholique de Louvain, 2, Place Sainte-Barbe, 1348, Louvain-la-Neuve</wicri:regionArea>
<orgName type="university">Université catholique de Louvain</orgName>
<placeName><settlement type="city">Louvain-la-Neuve</settlement>
<region type="region" nuts="1">Région wallonne</region>
<region type="province" nuts="1">Province du Brabant wallon</region>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">Belgique</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2005</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
</series>
<idno type="istex">26F305292541457FD20654B2FB9433989CC9575C</idno>
<idno type="DOI">10.1007/11564751_74</idno>
<idno type="ChapterID">Chap74</idno>
<idno type="ChapterID">74</idno>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: Our goal is to build a declarative framework for approximate graph matching where various constraints can be stated upon the pattern graph, enabling approximate constrained subgraph matching, extending models and constraints proposed by Rudolf [1] and Valiente et al. [2]. In the present work, we propose a CSP approach for approximate subgraph matching where the potential approximation is declaratively stated in the pattern graph as mandatory/optional nodes/edges. Forbidden edges, that is edges that may not be included in the matching, can be declared on the pattern graph. We also want to declare properties between pairs of nodes in the pattern graph, such as distance properties, that can be either stated by the user, or automatically inferred by the system. In the former case, such properties can define new approximate patterns. In the latter case, these redundant constraints enhance the pruning.</div>
</front>
</TEI>
<affiliations><list><country><li>Belgique</li>
</country>
<region><li>Province du Brabant wallon</li>
<li>Région wallonne</li>
</region>
<settlement><li>Louvain-la-Neuve</li>
</settlement>
<orgName><li>Université catholique de Louvain</li>
</orgName>
</list>
<tree><country name="Belgique"><region name="Région wallonne"><name sortKey="Zampelli, Stephane" sort="Zampelli, Stephane" uniqKey="Zampelli S" first="Stéphane" last="Zampelli">Stéphane Zampelli</name>
</region>
<name sortKey="Deville, Yves" sort="Deville, Yves" uniqKey="Deville Y" first="Yves" last="Deville">Yves Deville</name>
<name sortKey="Deville, Yves" sort="Deville, Yves" uniqKey="Deville Y" first="Yves" last="Deville">Yves Deville</name>
<name sortKey="Dupont, Pierre" sort="Dupont, Pierre" uniqKey="Dupont P" first="Pierre" last="Dupont">Pierre Dupont</name>
<name sortKey="Dupont, Pierre" sort="Dupont, Pierre" uniqKey="Dupont P" first="Pierre" last="Dupont">Pierre Dupont</name>
<name sortKey="Zampelli, Stephane" sort="Zampelli, Stephane" uniqKey="Zampelli S" first="Stéphane" last="Zampelli">Stéphane Zampelli</name>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001B84 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001B84 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Musique
   |area=    MozartV1
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     ISTEX:26F305292541457FD20654B2FB9433989CC9575C
   |texte=   Approximate Constrained Subgraph Matching
}}

This area was generated with Dilib version V0.6.20.
Data generation: Sun Apr 10 15:06:14 2016. Site generation: Tue Feb 7 15:40:35 2023

	Serveur d'exploration sur Mozart
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur Mozart

Approximate Constrained Subgraph Matching

Approximate Constrained Subgraph Matching

Source :

Abstract

Links toward previous steps (curation, corpus...)

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri